Reachability Analysis Based Circuit-Level Formal Verification

نویسنده

  • Chao Yan
چکیده

This dissertation presents a novel verification technique for analog and mixed signal circuits. Analog circuits are widely used in many applications such as consumer electronics, telecommunications, medical electronics, and so on. Furthermore, in deep sub-micron design, physical effects might undermine common digital abstractions of circuit behavior. Therefore, it is necessary to develop systematic methodologies to formally verify hardware design using circuit-level models. We present a formal method for circuit-level verification. Our approach is based on translating verification problems to reachability analysis problems. It applies nonlinear ODEs to model circuit dynamics using modified Nodal analysis. Based on the mathematical model, forward reachable regions are computed from given initial states to explore all possible circuit behaviors. Analog properties are checked on all circuit states to ensure fully correctness or find a design flaw. Our specification language extends LTL logic with continuous time and values and applies Brockett annuli to specify analog signals. We also introduced probability into the specification to support practical analog properties such as metastability behavior. We developed and implemented a reachability analysis tool COHO for nonlinear, high-dimensional hybrid systems. COHO employs projectagons to represent and manipulate high-dimensional, non-convex reachable regions. COHO solves nonlinear ODEs efficiently by conservatively approximating ODEs as linear differential inclusions. COHO is robust and efficient. It uses arbitrary precision rational numbers to implement exact computation and trims projectagons to remove infeasible regions. To improve performance and reduce error, several techniques are developed, including a guess-verify strategy, hybrid computation, approximate

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Circuit-Level Verification of Practical Circuits Based on Reachability Analysis

Formal verification of analog and mixed signal circuits using continuous models is a promising area. As a consequence, hybrid system techniques, especially reachability analysis, have been applied to verify AMS designs. However, reachability computation is extremely expensive for high-dimensional, nonlinear hybrid systems. Therefore, it is challenging to verify large, practical circuits using a...

متن کامل

Projectagon-Based Reachability Analysis for Circuit-Level Formal Verification

This dissertation presents a novel verification technique for analog and mixed sig-nal circuits. Analog circuits are widely used in many applications include con-sumer electronics, telecommunications, medical electronics. Furthermore, in deepsub-micron design, physical effects might undermine common digital abstractionsof circuit behavior. Therefore, it is necessary to develop s...

متن کامل

Reachability checking in complex and concurrent software systems using intelligent search methods

Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...

متن کامل

Time Domain Verification of Oscillator Circuit Properties

The application of formal methods to analog and mixed signal circuits requires efficient methods for constructing abstractions of circuit behaviors. This paper concerns the verification of properties of oscillator circuits. Generic monitor automata are proposed to facilitate the application of hybrid system reachability computations to characterize time domain features of oscillatory behavior, ...

متن کامل

Formal Verification of Safety Properties in Timed Circuits

The incorporation of timing makes circuit verification computationally expensive. This paper proposes a new approach for the verification of timed circuits. Rather than calculating the exact timed state space, a conservative overestimation that fulfills the property under verification is derived. Timing analysis with absolute delays is efficiently performed at the level of event structures and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010